Task Allocation Using a Team of Robots
نویسندگان
چکیده
Abstract Purpose of Review Task allocation using a team or coalition robots is one the most important problems in robotics, computer science, operational research, and artificial intelligence. We present survey multi-robot task covering many problem variants solution approaches, both centralized decentralized. Recent Findings In recent work, research has focused on handling complex objectives feasibility constraints amongst other variations problem. There are examples progress these directions, which captured this survey, along with similar for various solutions that have been developed to solve such problems. Summary first general formulation generalizes several versions well-studied. Our includes states robots, tasks, surrounding environment they operate, we describe how can be varied depending constraints, objective functions, level dynamically changing information. addition, discuss existing approaches including optimization-based market-based approaches.
منابع مشابه
Distributed Task Allocation in Swarms of Robots
This chapter introduces a swarm intelligence-inspired approach for target allocation in large teams of autonomous robots. For this purpose, the Distributed Bees Algorithm (DBA) was proposed and developed by the authors. The algorithm allows decentralized decision-making by the robots based on the locally available information, which is an inherent feature of animal swarms in nature. The algorit...
متن کاملDistributed Task Allocation in Swarms of Robots
This chapter introduces a swarm intelligence-inspired approach for target allocation in large teams of autonomous robots. For this purpose, the Distributed Bees Algorithm (DBA) was proposed and developed by the authors. The algorithm allows decentralized decision-making by the robots based on the locally available information, which is an inherent feature of animal swarms in nature. The algorit...
متن کاملMultiple Task Allocation Problems with Team Formation
Multiple task allocation with team formation is a NP-hard hierarchical combinatorial optimization problem, and some restrictions must be imposed on task and team combinations. Through task classification, and imposing restrictions on the number of tasks that an agent can perform, and the number of agents that a team can have, the set of feasible allocations is significantly reduced. Based on th...
متن کاملEmergent Task Allocation for Mobile Robots
Abstract— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computationally expensive and may require a large number of messages between the robots as the robots need to be aware of the global spatiotemporal information. In this paper, we introduce an emergent task allocation app...
متن کاملAuctions for task allocation to robots
We present an auction-based method for dynamic allocation of tasks to robots. The robots operate in a 2D environment for which they have a map. Tasks are locations in the map that have to be visited by the robots, in any order. Unexpected obstacles and other delays may prevent a robot from completing its allocated tasks. Therefore tasks not yet achieved are rebid every time a task has been comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Current Robotics Reports
سال: 2022
ISSN: ['2662-4087']
DOI: https://doi.org/10.1007/s43154-022-00087-4